Concealed Contributors to Result Quality — The Search Process of Ant Colony System

ثبت نشده
چکیده

Stochastic solvers are researched primarily with the goal of providing ‘black box’ optimisation approaches for situations where the optimisation problem is too complex to model and therefore impossible to solve using a deterministic approach. Sometimes, however, problems or their instances have characteristics which interact with the solver in undocumented and unpredictable ways. This paper reviews some pertinent examples in the literature and provides an experiment which demonstrates that ant colony optimisation has arcane mechanisms which are partly responsible for results which are currently attributed to the pheromone-based learning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concealed Contributors to Result Quality - The Search Process of Ant Colony System

Stochastic solvers are researched primarily with the goal of providing ‘black box’ optimisation approaches for situations where the optimisation problem is too complex to model and therefore impossible to solve using a deterministic approach. Sometimes, however, problems or their instances have characteristics which interact with the solver in undocumented and unpredictable ways. This paper rev...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

Flow shop Scheduling Problem with Maintenance Coordination: a New Approach

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007